Algorithm to Generate DFA for AND-operator in Regular Expression
نویسندگان
چکیده
For the past time a number of algorithms were presented to produce a deterministic finite automaton (DFA) for the regular expression. These algorithms could be divided into what they used as an initial data from which to produce DFA. The method to produce DFA from non-deterministic finite automaton (NFA) by a subset construction could be generalized for extended regular expressions, including intersection, negation and subtraction of the regular languages. In this article the modified algorithm of subset construction is presented; this algorithm produces a unigram DFA for the regular expression with extensions (specifically AND-operator).
منابع مشابه
Construction of a Minimal Deterministic Finite Automaton from a Regular Expression
This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a minimal deterministic finite automaton M suc...
متن کاملCompact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speciic properties of Glushkov's nondeterministic nite automaton (NFA) construction algorithm, we are able to encode the DFA using (m + 1)(2 m+1 + jj) bits, where m is the number of characters (excluding operator symbols) in the regular expression and is the alphabet. This compares favorably against the wors...
متن کاملFacial expression recognition based on Local Binary Patterns
Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...
متن کاملA Design Method of a Regular Expression Matching Circuit Based on Decomposed Automaton
This paper shows a design method for a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert a regular expression into a non-deterministic finite automaton (NFA). Then, to reduce the number of states, we convert the NFA into a merged-states non-deterministic finite automaton with unbounded string transition (MN...
متن کاملBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Network intrusion detection and prevention systems commonly use regular expression (RE) signatures to represent individual security threats. While the corresponding DFA for any one RE is typically small, the DFA that corresponds to the entire set of REs is usually too large to be constructed or deployed. To address this issue, a variety of alternative automata implementations that compress the ...
متن کامل